Vlsi Floorplanning with Boundary Constraints Using Generalized Polish Expression
نویسندگان
چکیده
Module floorplanning/placement considering boundary constraints is practical and crucial in modern designs because designers may want to place some I/O involved modules along the chip boundary to minimize both chip area and off-chip connections. In this paper, a boundary information checking algorithm based on a general structure representation, called Generalized Polish Expression (GPE), is proposed. The algorithm, coupled with efficient perturbations in GPE, effectively produces solutions that satisfy both the boundary constraints and small chip area requirement. The experimental results have shown good performance from our approach on several commonly used MCNC benchmarks.
منابع مشابه
A Survey of Various Metaheuristic Algorithms Used to Solve VLSI Floorplanning Problem
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-ha...
متن کاملSlicing floorplans with boundary constraints
In floorplanning of very large scale integration design, it is useful if users are allowed to specify some placement constraints in the packing. One particular kind of placement constraints is to pack some modules on one of the four sides: on the left, on the right, at the bottom, or at the top of the final floorplan. These are called boundary constraints. In this paper, we enhanced a well-know...
متن کاملApplication of Area Predicted TCG Algorithm in Floorplanning with Boundary Constraint
Floorplanning determines the positions of blocks on a chip subject to various objectives. In practical physical design, on the requirement of placing some blocks along the boundaries of the chip such as the blocks can be connected to I/O pads, the floorplanning with boundary constraint is raised. In this paper, we apply a floorplanning algorithm named area predicted transitive closure graphs (A...
متن کاملA Heuristic Approach for VLSI Floorplanning
Floorplanning is an essential step in VLSI chip design automation. The main objective of the floorplanning is to find a floorplan such that the cost is minimized. This is achieved by minimizing the chip area and interconnection cost. It determines the performance, size, yield and reliability of VLSI chips. We propose a Memetic Algorithm (MA) for non-slicing and hard module VLSI floorplanning pr...
متن کاملNon Slicing Floorplan Representations in VLSI Floorplanning: A Summary
Floorplan representation is a fundamental issue in designing a VLSI floorplanning algorithm as the representation has a great impact on the feasibility and complexity of floorplan designs. This survey paper gives an up-to-date account on various nonslicing floorplan representations in VLSI floorplanning.
متن کامل